ISBORD: Internet Searching Based on Resource Description

Based on the Information-Centric Networking (ICN) concept and the mature model of the current TCP/IP-based Internet, we propose content searching based on universal and scalable resource description, namely ISBORD (Internet Searching based on Resource Description). This novel concept aims to improve the efficiency of content searching and simplifies the end-user functionality to support the evolution of the content-centric Internet

Distributed All-IP Mobility Management Architecture Supported by the NDN Overlay

Two of the most promising candidate solutions for realizing the next-generation all-IP mobile networks are Mobile IPv6 (MIPv6), which is the host-based and global mobility supporting protocol, and Proxy MIPv6 (PMIPv6), which is the network-based and localized mobility supporting protocol. However, the unprecedented growth of mobile Internet traffic has resulted in the development of distributed mobility management (DMM) architecture by the Internet engineering task force DMM working group. The extension of the basic MIPv6 and PMIPv6 to support their distributed and scalable deployment in the future is one of the major goals of the DMM working group. We propose an all-IP-based mobility management architecture that leverages the concept of Named Data Networking (NDN), which is a distributed content management and addressing architecture. In the proposed solution, mobility support services are distributed among multiple anchor points at the edge of the network, thereby enabling a flat architecture that exploits name-based routing in NDN. Our approach overcomes some of the major limitations of centralized IP mobility management solutions, by extending existing routing protocol and mobility management architecture, to distribute the mobility management function of anchor points in the IP network and optimize the transmission path of mobile traffic

A Distance-Heuristic Tree Building Approach in Application Layer Multicast

In the application layer multicast (ALM), clustering nearby nodes can effectively improve the multicast performance. However, it is difficult for the ALM solution to quickly and accurately position the newcomer, because group members have no direct knowledge of underlying network topology. Additionally, ALM delivery trees with different performances are built when group members join the group in different join sequences. To alleviate the above problems, this paper proposes a distance-heuristic tree building protocol (called DHTB). DHTB uses our proposed distance-constrained cluster model and close-member-first-receive (CF) rule. In the model, most nearby nodes are grouped into some distance-constrained clusters, with little cluster organization and maintenance overhead. The CF rule arranges or rearranges the locations of group members according to related distances, and effectively positions the newcomer with the help of on-demand landmarks. Both the distance-constrained cluster model and CF rule are distance-heuristic. Therefore DHTB can alleviate the join sequence problem, and build the ALM tree with desirable performance

Is DNS Ready for Ubiquitous Internet of Things?

The vision of the Internet of Things (IoT) covers not only the well-regulated processes of specific applications in different areas but also includes ubiquitous connectivity of more generic objects (or things and devices) in the physical world and the related information in the virtual world. For example, a typical IoT application, such as a smart city, includes smarter urban transport networks, upgraded water supply, and waste-disposal facilities, along with more efficient ways to light and heat buildings. For smart city applications and others, we require unique naming of every object and a secure, scalable, and efficient name resolution which can provide access to any object\u27s inherent attributes with its name. Based on different motivations, many naming principles and name resolution schemes have been proposed. Some of them are based on the well-known domain name system (DNS), which is the most important infrastructure in the current Internet, while others are based on novel designing principles to evolve the Internet. Although the DNS is evolving in its functionality and performance, it was not originally designed for the IoT applications. Then, a fundamental question that arises is: can current DNS adequately provide the name service support for IoT in the future? To address this question, we analyze the strengths and challenges of DNS when it is used to support ubiquitous IoT. First, we analyze the requirements of the IoT name service by using five characteristics, namely security, mobility, infrastructure independence, localization, and efficiency, which we collectively refer to as SMILE. Then, we discuss the pros and cons of the DNS in satisfying SMILE in the context of the future evolution of the IoT environment

Distributed all-IP mobility management architecture supported by the NDN overlay

Two of the most promising candidate solutions for realizing the next-generation all-IP mobile networks are Mobile IPv6 (MIPv6), which is the host-based and global mobility supporting protocol, and Proxy MIPv6 (PMIPv6), which is the network-based and localized mobility supporting protocol. However, the unprecedented growth of mobile Internet traffic has resulted in the development of distributed mobility management (DMM) architecture by the Internet engineering task force DMM working group. The extension of the basic MIPv6 and PMIPv6 to support their distributed and scalable deployment in the future is one of the major goals of the DMM working group. We propose an all-IP-based mobility management architecture that leverages the concept of Named Data Networking (NDN), which is a distributed content management and addressing architecture. In the proposed solution, mobility support services are distributed among multiple anchor points at the edge of the network, thereby enabling a flat architecture that exploits name-based routing in NDN. Our approach overcomes some of the major limitations of centralized IP mobility management solutions, by extending existing routing protocol and mobility management architecture, to distribute the mobility management function of anchor points in the IP network and optimize the transmission path of mobile traffi

Fast kNN Graph Construction with Locality Sensitive Hashing

Abstract. The k nearest neighbors (kNN) graph, perhaps the most popular graph in machine learning, plays an essential role for graphbased learning methods. Despite its many elegant properties, the brute force kNN graph construction method has computational complexity of O(n 2 ), which is prohibitive for large scale data sets. In this paper, based on the divide-and-conquer strategy, we propose an efficient algorithm for approximating kNN graphs, which has the time complexity of O(l(d + log n)n) only (d is the dimensionality and l is usually a small number). This is much faster than most existing fast methods. Specifically, we engage the locality sensitive hashing technique to divide items into small subsets with equal size, and then build one kNN graph on each subset using the brute force method. To enhance the approximation quality, we repeat this procedure for several times to generate multiple basic approximate graphs, and combine them to yield a high quality graph. Compared with existing methods, the proposed approach has features that are: (1) much more efficient in speed (2) applicable to generic similarity measures; (3) easy to parallelize. Finally, on three benchmark large-scale data sets, our method beats existing fast methods with obvious advantages

Network Mobility in a Locator/ID Separation Context

Internet Engineering Task Force (IETF) has proposed an extension based on Mobile IPv6 (MIPv6), named as network mobility basic support protocol (NEMO-BSP), to support NEMO in IPv6 networks. However, NEMO-BSP inherits all the drawbacks of MIPv6, such as inefficient routing path, high handover latency, and packet encapsulation overhead. To address these drawbacks of NEMO-BSP, this paper proposes an NEMO supporting scheme based on a novel Locator/ID Separation (LIDS) architecture, namely LIDS-NEMO. In LIDS-NEMO, Multiple Virtual Mapping (MVM) scheme is proposed to differentiate the intra-NEMO and inter-NEMO mobility. Besides, packets are transmitted through the most optimized route in LIDS-NEMO. The simulation results show that LIDS-NEMO reduces the signaling cost significantly when compared with NEMO-BSP and it will be a promising scheme to provide NEMO support in the LIDS context

Single-state distributed k-winners-take-all neural network model

Abstract Distributed k-winners-takes-all (k-WTA) neural network (k-WTANN) models have better scalability than centralized ones. In this work, a distributed k-WTANN model with a simple structure is designed for the efficient selection of k winners among a group of more than k agents via competition based on their inputs. Unlike an existing distributed k-WTANN model, the proposed model does not rely on consensus filters, and only has one state variable. We prove that under mild conditions, the proposed distributed k-WTANN model has global asymptotic convergence. The theoretical conclusions are validated via numerical examples, which also show that our model is of better convergence speed than the existing distributed k-WTANN model